The optimal allocation of server time slots over different classes of patients
نویسندگان
چکیده
We present a model for assigning server time slots to different classes of patients. The objective is to minimize the total expected weighted waiting time of a patient (where different patient classes may be assigned different weights). A bulk service queueing model is used to obtain the expected waiting time of a patient of a particular class, given a feasible allocation of service time slots. Using the output of the bulk service queueing models as the input of an optimization procedure, the optimal allocation scheme may be identified. For problems with a large number of patient classes and/or a large number of feasible allocation schemes, a step-wise heuristic is developed. A common example of such a system is the allocation of operating room time slots over different medical disciplines in a hospital.
منابع مشابه
Optimal Power Management to Minimize SER in Amplify and-Forward Relay Networks
This paper studies optimal power allocation to minimize symbol error rate (SER) of amplify-and-forward cooperative diversity networks. First, we analytically solve optimal power allocation problem to minimize SER for three different scenarios, namely, multi-branch single-relay, single-branch multi-relay and multi-branch multi-relay cooperative diversity networks, all subject to a given total re...
متن کاملOptimal Server Allocation in Batches
In this paper we consider the problem of allocating bandwidth to two transmitters/queues with arbitrary arrival processes, so as to minimize the total expected (discounted) holding cost of backlogged packets in the system over a finite (infinite) horizon. The bandwidth is in the form of time slots in a TDMA schedule. Allocation decisions are made based on the queue backlog information, which is...
متن کاملDevelopment of a Genetic Algorithm for Advertising Time Allocation Problems
Commercial advertising is the main source of income for TV channels and allocation of advertising time slots for maximizing broadcasting revenues is the major problem faced by TV channel planners. In this paper, the problem of scheduling advertisements on prime-time of a TV channel is considered. The problem is formulated as a multi-unit combinatorial auction based mathematical model. This is a...
متن کاملAdaptive call admission control and resource allocation in multi server wireless/cellular network
The ever increasing demand of the subscribers has put pressure on the capacity of wireless networks around the world. To utilize the scare resources, in the present paper we propose an optimal allocation scheme for an integrated wireless/cellular model with handoff priority and handoff guarantee services. The suggested algorithm optimally allocates the resources in each cell and dynamically adj...
متن کاملOptimal Bandwidth Allocation With Delayed State Observation and Batch Assignment
In this paper we consider the problem of allocating bandwidth/server to multiple user transmitters/queues with identical but arbitrary arrival processes, to minimize the total expected holding cost of backlogged packets in the system over a finite horizon. The special features of this problem are that (1) packets continuously arrive at these queues regardless of the allocation decision, (2) the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- European Journal of Operational Research
دوره 219 شماره
صفحات -
تاریخ انتشار 2012